An Energy Efficient Set Associative Cache Algorithm
نویسندگان
چکیده
منابع مشابه
An Energy Efficient Set Associative Cache Algorithm
Set associative caches have fixed ways. Entire cache is enabled during cache operation. This paper proposes cache architecture mapping cache line to fixed cache way of mapped set. The address is mapped to set as in conventional set associative cache. The tag value of the mapped line is divided into blocks of size of number of cache ways. The average of maximum and minimum frequency of this divi...
متن کاملAn Energy Saving Set Associative Cache Algorithm with Improved Performance
Enabling one way in set associative cache during operation is proposed in literature. However, this architecture degrades the average memory access time. This paper proposes an algorithm to map to certain way in set associative cache improving the performance. The address is mapped to certain way by certain transformations involving XOR'ing and shifting and bit selection. The line is accessed o...
متن کاملImproving Cache Power EÆciency with an Asymmetric Set-Associative Cache
Data caches are widely used in general-purpose processors as a means to hide long memory latencies. Set-associativity in these caches helps programs avoid performance problems due to cache mapping con icts. Many programs, however, need high associativity for only some of their frequently-referenced addresses and tolerate much lower associativity for the remainder of the references. With this va...
متن کاملA Low Energy Set-Associative I-Cache with Extended BTB
This paper proposes a low-energy instruction-cache architecture, called history-based tag-comparison (HBTC) cache. The HBTC cache attempts to re-use tag-comparison results for avoiding unnecessary way activation in setassociative caches. The cache records tag-comparison results in an extended BTB, and re-uses them for directly selecting only the hit-way which includes the target instruction. In...
متن کاملSet Associative Cache Behavior Optimization
One of the most important issues related to program performance is the memory hierarchy behavior. Programmers try nowadays to optimize this behavior intuitively or using costly techniques such as trace-driven simulations through a trial and error process. A systematic modeling strategy that allows an automated analysis of the memory hierarchy performance is developed in this work. This approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/11646-7137